Cubes and their centers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imaginary Cubes and Their Puzzles

Imaginary cubes are three dimensional objects which have square silhouette projections in three orthogonal ways just as a cube has. In this paper, we study imaginary cubes and present assembly puzzles based on them. We show that there are 16 equivalence classes of minimal convex imaginary cubes, among whose representatives are a hexagonal bipyramid imaginary cube and a triangular antiprism imag...

متن کامل

The shuffle-cubes and their generalization

In this paper, we first present a new variation of hypercubes, denoted by SQn. SQn is obtained from Qn by changing some links. SQn is also an n-regular n-connected graph but of diameter about n/4. Then, we present a generalization of SQn. For any positive integer g, we can construct an n-dimensional generalized shuffle-cube with 2n vertices which is n-regular and n-connected. However its diamet...

متن کامل

Some partial Latin cubes and their completions

It iswell known that all n×n partial Latin squareswith atmost n−1 entries are completable. Our intent is to extend this well known statement to partial Latin cubes.We show that if an n×n×n partial Latin cube contains at most n − 1 entries, no two of which occupy the same row, then the partial Latin cube is completable. Also included in this paper is the problem of completing 2×n×n partial Latin...

متن کامل

Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes

If f is a binary word and d a positive integer, then the generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all the vertices that contain f as a factor, while the generalized Lucas cube Qd( ↽Ð f ) is the graph obtained from Qd by removing all the vertices that have a circulation containing f as a factor. The Fibonacci cube Γd and the Lucas cube Λd are the grap...

متن کامل

Finding Communities by Their Centers

Detecting communities or clusters in a real-world, networked system is of considerable interest in various fields such as sociology, biology, physics, engineering science, and interdisciplinary subjects, with significant efforts devoted in recent years. Many existing algorithms are only designed to identify the composition of communities, but not the structures. Whereas we believe that the loca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Mathematica Hungarica

سال: 2017

ISSN: 0236-5294,1588-2632

DOI: 10.1007/s10474-017-0729-z